Operators of Equivalent Sorting Power and Related Wilf-equivalences

نویسندگان

  • Michael H. Albert
  • Mathilde Bouvel
چکیده

We study sorting operators A on permutations that are obtained composing Knuth’s stack sorting operator S and the reversal operator R, as many times as desired. For any such operator A, we provide a size-preserving bijection between the set of permutations sorted by S ◦ A and the set of those sorted by S ◦ R ◦ A, proving that these sets are enumerated by the same sequence, but also that many classical permutation statistics are equidistributed across these two sets. The description of this family of bijections is based on a bijection between the set of permutations avoiding the pattern 231 and the set of those avoiding 132 which preserves many permutation statistics. We also present other properties of this bijection, in particular for finding pairs of Wilf-equivalent permutation classes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shape-wilf-equivalences for Vincular Patterns

We extend the notion of shape-Wilf-equivalence to vincular patterns (also known as “generalized patterns” or “dashed patterns”). First we introduce a stronger equivalence on patterns which we call filling-shape-Wilfequivalence. When vincular patterns α and β are filling-shape-Wilf-equivalent, we prove that α⊕ σ and β ⊕ σ must also be filling-shape-Wilf-equivalent. We also discover two new pairs...

متن کامل

Equivalence between two-dimensional cell-sorting and one-dimensional generalized random walk -- spin representations of generating operators

The two-dimensional cell-sorting problem is found to be mathematically equivalent to the one-dimensional random walk problem with pair creations and annihilations, i.e. the adhesion probabilities in the cell-sorting model relate analytically to the expectation values in the random walk problem. This is an example demonstrating that two completely different biological systems are governed by a c...

متن کامل

Algorithms for discovering and proving theorems about permutation patterns

We present an algorithm, called BiSC, that describes the patterns avoided by a given set of permutations. It automatically conjectures the statements of known theorems such as the descriptions of stack-sortable (Knuth 1975) and West-2-stack-sortable permutations (West 1990), smooth (Lakshmibai and Sandhya 1990) and forest-like permutations (Bousquet-Mélou and Butler 2007), and simsun permutatio...

متن کامل

Completion of the Wilf-Classification of 3-5 Pairs Using Generating Trees

A permutation π is said to avoid the permutation τ if no subsequence in π has the same order relations as τ . Two sets of permutations Π1 and Π2 are Wilfequivalent if, for all n, the number of permutations of length n avoiding all of the permutations in Π1 equals the number of permutations of length n avoiding all of the permutations in Π2. Using generating trees, we complete the problem of fin...

متن کامل

A General Theory of Wilf-Equivalence for Catalan Structures

The existence of apparently coincidental equalities (also called Wilf-equivalences) between the enumeration sequences or generating functions of various hereditary classes of combinatorial structures has attracted significant interest. We investigate such coincidences among non-crossing matchings and a variety of other Catalan structures including Dyck paths, 231-avoiding permutations and plane...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2014